Granular contact interfaces with non-circular particles
نویسندگان
چکیده
منابع مشابه
On the contact treatment of non-convex particles in the granular element method
We present a new contact algorithm that endows the granular element method [1] with the ability to model non-convex particles using non-uniform rational basis splines. This significant extension allows for the representation of particle morphological features, namely, sphericity and angularity, to their fullest extent, with local contact rolling resistance and interlocking emanating directly fr...
متن کاملContact-line pinning controls how quickly colloidal particles equilibrate with liquid interfaces.
Previous experiments have shown that spherical colloidal particles relax to equilibrium slowly after they adsorb to a liquid-liquid interface, despite the large interfacial energy gradient driving the adsorption. The slow relaxation has been explained in terms of transient pinning and depinning of the contact line on the surface of the particles. However, the nature of the pinning sites has not...
متن کاملCollision dynamics of granular particles with adhesion.
We investigate the collision of adhesive viscoelastic spheres in quasistatic approximation where the adhesive interaction is described by the Johnson, Kendall, and Roberts (JKR) theory. The collision dynamics, based on the dynamic contact force, describes both restitutive collisions quantified by the coefficient of restitution epsilon as well as aggregative collisions, characterized by the crit...
متن کاملInteraction of polymeric particles with surfactant interfaces
Approved: ____________________________________ Thesis Supervisor ____________________________________ Title and Department ____________________________________ Date
متن کاملContact Graphs of Circular Arcs
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interiordisjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most 2s− k edges, and (2, k)-tight if in addition it has exactly 2n− k edges, where n is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tribology International
سال: 2013
ISSN: 0301-679X
DOI: 10.1016/j.triboint.2013.08.005